A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
نویسندگان
چکیده
منابع مشابه
Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem
This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried out on a large set of instances have s...
متن کاملFix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems ¬リニ
In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the MLCLSP with setup carryover. Given an MIP model of a lot sizing problem, the approach iteratively solves a series of subproblems of the model until no better solution can be found. Each sub-problem re-optimizes a subset ...
متن کاملSolving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model....
متن کاملwww.econstor.eu A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problem
This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary...
متن کاملA Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problem
This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2015
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-015-9295-0